Composition codes
نویسندگان
چکیده
منابع مشابه
Constant composition codes derived from linear codes
In this paper, we propose a class of linear codes and obtain their weight distribution. Some of these codes are almost optimal. Moreover, several classes of constant composition codes(CCCs) are constructed as subcodes of linear codes.
متن کاملConstant Composition Codes as Subcodes of Linear Codes
Let p be an odd prime and q be a power of p. A linear [n, k, d] code over the finite field Fq is a k-dimensional subspace of F n q with minimum Hamming distance d. Let Ai denote the number of codewords with Hamming weight i in a linear code C of length n. The weight enumerator of C is defined by 1 + A1X + A2X 2 + · · ·+ AnX. The sequence (1, A1, · · · , An) is called the weight distribution of ...
متن کاملSome Unique Ternary Constant-composition Codes
The uniqueness of some ternary constant-composition codes is proved by combinato-rial methods. 1. Introduction. For all basic notions and facts about coding theory which are not introduced here we refer to [3]. All codes to be considered are ternary constant-composition codes. Ternary constant-composition (TCC) codes of length n are codes with constant composition of " zeros " , " ones " and " ...
متن کاملOn constant-composition codes over Zq
A constant-composition code is a special constant-weight code under the restriction that each symbol should appear a given number of times in each codeword. In this correspondence, we give a lower bound for the maximum size of the -ary constant-composition codes with minimum distance at least 3. This bound is asymptotically optimal and generalizes the Graham–Sloane bound for binary constant-wei...
متن کاملA Construction of Optimal Constant Composition Codes
In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal constant composition codes meeting the upper bound given by [13].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2016
ISSN: 1930-5346
DOI: 10.3934/amc.2016.10.163